A tool for simulating parallel branch-and-bound methods
نویسندگان
چکیده
منابع مشابه
Parallel Branch - and - Bound methods for the Job
Job-Shop Scheduling (JSS) problems are among the more diicult to solve in the class of NP-complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem , but with limited success. Even with recent methods, it is still not possible to so...
متن کاملParallel branch-and-bound methods for thejob-shop scheduling problem
Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of N P -complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to...
متن کاملBranch and Bound Methods
Branch and bound algorithms are methods for global optimization in nonconvex problems [LW66, Moo91]. They are nonheuristic, in the sense that they maintain a provable upper and lower bound on the (globally) optimal objective value; they terminate with a certificate proving that the suboptimal point found is ǫ-suboptimal. Branch and bound algorithms can be (and often are) slow, however. In the w...
متن کاملA Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods
In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...
متن کاملParallel Branch-and-Bound Algorithms
1.1. INTRODUCTION In the beginning of the twenty-first century, large unsolved combinatorial optimization problems have been solved exactly. Two impressive cases should be mentioned. First are two instances of the Monde, Transfert) newspapers. This impressive media frenzy reflected the impact of the achievement, which was deemed of the same order of magnitude as the victory of IBMs parallel com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Engineering
سال: 2016
ISSN: 2391-5439
DOI: 10.1515/eng-2016-0031